Improved high maximum stable throughput FCFS tree algorithms with interference cancellation

Tree algorithms form a well researched class of collision resolution algorithms for solving multiple access control problems. Signal interference cancellation, which allows one to recover additional information from otherwise lost collision signals, has recently been combined with tree algorithms, providing substantially higher maximum stable throughputs (MSTs), up to 0.693 (Yu and Giannakis, IEEE Transactions on Information Theory, Vol. 53(12), 2007). We propose two novel First-Come-First-Served tree algorithms, the operation of which is similar to the well-known tree splitting algorithms, that exploit interference cancellation and derive their MST. Furthermore, these algorithms are also designed such that, at all times, it suffices to store only one signal.